Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
نویسندگان
چکیده
An (F , Fd)-partition of a graph is a vertex-partition into two sets F and Fd such that the graph induced by F is a forest and the one induced by Fd is a forest with maximum degree at most d. We prove that every triangle-free planar graph admits an (F , F5)-partition. Moreover we show that if for some integer d there exists a trianglefree planar graph that does not admit an (F , Fd)-partition, then it is an NP-complete problem to decide whether a triangle-free planar graph admits such a partition.
منابع مشابه
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
We prove that every triangle-free planar graph of order n and size m has an induced linear forest with at least 9n−2m 11 vertices, and thus at least 5n+8 11 vertices. Furthermore, we show that there are triangle-free planar graphs on n vertices whose largest induced linear forest has order ⌈n2 ⌉+ 1.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملCovering planar graphs with forests
We study the problem of covering graphs with trees and a graph of bounded maximum degree. By a classical theorem of Nash-Williams, every planar graph can be covered by three trees. We show that every planar graph can be covered by two trees and a forest, and the maximum degree of the forest is at most 8. Stronger results are obtained for some special classes of planar graphs.
متن کاملLarge induced forests in planar graphs with girth 4 or 5
We give here some new lower bounds on the order of a largest induced forest in planar graphs with girth 4 and 5. In particular we prove that a triangle-free planar graph of order n admits an induced forest of order at least 6n+7 11 , improving the lower bound of Salavatipour [M. R. Salavatipour, Large induced forests in trianglefree planar graphs, Graphs and Combinatorics, 22:113–126, 2006]. We...
متن کاملAn improved bound on the largest induced forests for triangle-free planar graphs
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015